Integer Sets Containing No Arithmetic Progressions
نویسنده
چکیده
lfh and k are positive integers there exists N(h, k) such that whenever N ^ N(h, k), and the integers 1,2,...,N are divided into h subsets, at least one must contain an arithmetic progression of length k. This is the famous theorem of van der Waerden [10], dating from 1927. The proof of this uses multiple nested inductions, which result in extremely weak bounds for N{h,k). We shall define Bk to be the collection of all sets si £= N for which sf contains no arithmetic progression of length k. We then set
منابع مشابه
Arithmetic Progressions on Conics.
In this paper, we look at long arithmetic progressions on conics. By an arithmetic progression on a curve, we mean the existence of rational points on the curve whose x-coordinates are in arithmetic progression. We revisit arithmetic progressions on the unit circle, constructing 3-term progressions of points in the first quadrant containing an arbitrary rational point on the unit circle. We als...
متن کاملOn the Set of Common Differences in van der Waerden’s Theorem on Arithmetic Progressions
Analogues of van der Waerden’s theorem on arithmetic progressions are considered where the family of all arithmetic progressions, AP, is replaced by some subfamily of AP. Specifically, we want to know for which sets A, of positive integers, the following statement holds: for all positive integers r and k, there exists a positive integer n = w ′(k, r) such that for every r-coloring of [1, n] the...
متن کاملOn subsets of F1n containing no k-term progressions
In this short note we prove that for any fixed integer k and any prime power q ≥ k, there exists a subset of F q of size q2(k−1) +qk−1−1 which contains no k points on a line, and hence no k-term arithmetic progressions. As a corollary we obtain an asymptotic lower bound as n→∞ for rk(Fq ) when q ≥ k, which can be interpreted as the finite field analogue of Behrend’s construction for longer prog...
متن کاملGreedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions
We describe a "greedy" algorithm for partitioning the natural numbers into sets free of arithmetic progressions of length 3. A recursive formula governing the resulting partition is proved, and some features of its asymptotic behavior are discussed. Introduction. In 1927, van der Waerden [12] showed that if the set of nonnegative integers is partitioned into a finite number of sets, one of thes...
متن کاملInteger Sum Sets Containing Long Arithmetic Progressions
the Schnirelmann and lower asymptotic densities respectively of d. According to Schnirelmann theory (see [9]), if 1 > as/ > 0 and Oes/ then a(2s/) ^ 2a(s/)-a(s/) > a(s/); and if a(s/)^\ then 2s/ = No. From this it follows that if as/ > 0 then there exists a positive integer k such that s/ is a basis of order k (that is, ks/ = No). According to Kneser's theorem [6], if dsf > 0 and Oes/ then eith...
متن کامل